Differential logical relations, part II increments and derivatives
نویسندگان
چکیده
We study the deep relation existing between differential logical relations and incremental computing by showing how self-differences in former precisely correspond to derivatives latter. The byproduct of such a relationship is twofold: on one hand, we show can be seen as powerful meta-theoretical tool analysis computations, enabling an easy proof soundness differentiation. On other generalize so able interpret full recursion, something not possible original system.
منابع مشابه
Revising Z : Part II - logical developmentMartin
This is the second of two related papers. In \Revising Z: Part I-logic and semantics" (this journal) we introduced a simple speciication logic Z C comprising a logic and a semantics (in ZF set theory). We then provided an interpretation for (a rational reconstruction of) the speciication language Z within Z C. As a result we obtained a sound logic for Z, including the basic schema calculus. In ...
متن کاملA Logical Relations for a Logical Framework
Logical relations are a central concept used to study various higher-order type theories and occur frequently in the proofs of a wide variety of meta-theorems. Besides extending the logical relation principle to more general languages, an important research question has been how to represent and thus verify logical relation arguments in logical frameworks. We formulate a theory of logical relat...
متن کاملKripke Logical Relations and PCF
Sieber has described a model of PCF consisting of continuous functions that are invariant under certain ((nitary) logical relations, and shown that it is fully abstract for closed terms of up to third-order types. We show that one may achieve full abstraction at all types using a form of \Kripke logical relations" introduced by Jung and Tiuryn to characterize-deenability.
متن کاملOn Logical Relations and Conservativity
Having developed a Montague-like interpretation of a fragment of natural language, one may want to modify it in order to accomodate further linguistic phenomena. This may require radical changes in the semantic interpretation of syntactic categories. For instance, one may want to raise the semantic type assigned to the category of adverbial modifiers in order to account for quantified adverbial...
متن کاملLogical Relations for Encryption
The theory of relational parametricity and its logical relations proof technique are powerful tools for reasoning about information hiding in the polymorphic λ-calculus. We investigate the application of these tools in the security domain by defining a cryptographic λ-calculus—an extension of the standard simply typed λ-calculus with primitives for encryption, decryption, and key generation— an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2021
ISSN: ['1879-2294', '0304-3975']
DOI: https://doi.org/10.1016/j.tcs.2021.09.027